A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-depth Jaroslav Neˇsetˇril Patrice Ossona de Mendez Author address:

Source URL: iti.mff.cuni.cz

Cubical Type Theory Free bounded distributive lattice The free distributive lattice on a set J can be described as the set of finite antichains in the poset of finite subsets of J, for the order L 6 M if, and only if, f

Source URL: www.cse.chalmers.se

LOCAL LIPSCHITZ CONTINUITY OF THE DIAMETRIC COMPLETION MAPPING J. P. MORENO AND R. SCHNEIDER Abstract. The diametric completion mapping associates with every closed bounded set C in a normed linear space the set γ(C) of

Source URL: home.mathematik.uni-freiburg.de

The Grad of a Graph and Classes with Bounded Expansion Jaroslav Neˇsetˇril 1 Department of Applied Mathematics and Institute of Theoretical Computer Science Charles University Praha, Czech Republic

Source URL: iti.mff.cuni.cz

PTAS for maximum weight independent set problem with random weights in bounded degree graphs David Gamarnik ∗

Source URL: www2.isye.gatech.edu

Cubical Type Theory Free bounded distributive lattice The free distributive lattice on a set J can be described as the set of finite antichains in the poset of finite subsets of J, for the order L 6 M if, and only if, f

Source URL: www.cse.chalmers.se

A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension∗ Esther Ezra† Abstract Let (X, S) be a set system on an n-point set X. The discrepancy of S is defined as the minimum of the

Source URL: www.cims.nyu.edu

• Computational geometry
• Ε-net
• Big O notation
• Diophantine approximation
• Mathematics
• Theoretical computer science
• Mathematical analysis

BRICS Basic Research in Computer Science BRICS RSBrodal et al.: Finding Maximal Pairs with Bounded Gap Finding Maximal Pairs with Bounded Gap

Source URL: www.brics.dk

• Suffix tree
• Tree
• Binary tree
• Mathematics
• Computing
• Computer programming
• Scapegoat tree
• Set theory
• Maximal pair
• String

Let X be an M×N grayscale image with n=MN pixels xi with values in the set {0, 1, …, 255}

Source URL: www.ws.binghamton.edu

• Steganography
• Statistical classification
• Steganalysis
• Digital photography
• Gain
• Embedding
• Receiver operating characteristic
• Jessica Fridrich
• Bounded-error probabilistic polynomial
• Mathematics
• Espionage
• Statistics

Aissen’s Convex Set Function Steven Finch September 29, 2014 Let D be a bounded open convex set in the plane and let C denote the boundary of D. For each p ∈ D and q ∈ C, let hpq be the Euclidean distance from p to

Source URL: www.people.fas.harvard.edu

• Circles
• Convex analysis
• Convex geometry
• Incircle and excircles of a triangle
• Triangle
• Circumscribed circle
• Convex set
• Convex function
• Area
• Geometry
• Triangle geometry
• Triangles